Multiple Description Coding: Typical Arguments and Random Binning
نویسنده
چکیده
We reexamine the problem of Multiple Description coding considered last week. We briefly review the import concepts and results. An overview of the basic methods of proof are provided. We further formulate this problem in the context of distributed source coding and from this framework examine a practical coding scheme for the symmetric problem provided by Pradhan et. al.
منابع مشابه
On Achievable Rates for Channels with Mismatched Decoding
The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods: superposition coding and random binning. The inner bounds are derived by analyzing the average error probability of the code ensemble for both methods and by a ...
متن کاملA Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding
Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...
متن کاملOn Achievability via Random Binning
In [1], the authors present a novel tool to establish achievability results in network information theoretic problems. The main idea is to study a set of discrete memoryless correlated sources, and the ensuing statistics of the bin indices resulting from random binning of the sources. Sufficient conditions are established on rates of random binning such that these indices are mutually independe...
متن کاملA New Random Coding Technique that Generalizes Superposition Coding and Binning
Proving capacity for networks without feedback or cooperation usually involves two fundamental random coding techniques: superposition coding and binning. Although conceptually very different, these two techniques often achieve the same performance, suggesting an underlying similarity. In this correspondence we propose a new random coding technique that generalizes superposition coding and binn...
متن کاملThe Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution when exists has a “single-letter” form. This reflects the fact that optimum performance can be approached by a random code (or a random binning scheme), generated using independent and identically distributed copies of some single-letter distribution. Is that the form of the solution of any (information theoretic) proble...
متن کامل